7 Program semantics and infinite regular terms
نویسندگان
چکیده
The communication by Gilles Kahn, Jean Vuillemin and myself at the second International Colloquium on Automata, Languages and Programming, held in Saarbrücken in 1974 is in French in the proceedings, and has not been published as a journal article. However, Todd Veldhuizen wrote in 2002 an English translation that is reproduced in the next chapter. À propos Chapter 8 It was quite a surprise for me to receive a message from Todd Veldhuizen saying that he had translated from French a 30-year-old conference paper presented at the second International Colloquium on Automata, Languages and Programming, held in Saarbrücken in 1974, of which I am coauthor with G. Kahn and J. Vuillemin. He did that work because he felt the paper was “seminal”. First of all I would like to thank him for this work. The publication of his translation in a volume dedicated to the memory of Gilles Kahn is a testimony of the gratitude of Jean Vuillemin and myself to him, and the recognition of an important scientific contribution of Gilles among many others. In this overview, I indicate a few research directions that can be traced back to that communication. I give only a few related references, this overview is not a thorough bibliographical review of related articles. In the late 1960s, D. Scott constructed the first model of lambdacalculus, and his construction has been a corner stone for the theory of semantic domains and for denotational semantics [10,12]. Formal semantics of programming languages was beginning during these years. From Semantics to Computer Science Essays in Honour of Gilles Khan, eds Yves Bertot, Gérard Huet, Jean-Jacques Lévy and Gordon Plotkin. Published by Cambridge University Press. c © Cambridge University Press 2009.
منابع مشابه
Expressibility in the Lambda Calculus with Mu
We address a problem connected to the unfolding semantics of functional programming languages: give a useful characterization of those infinite λ-terms that are λletrec-expressible in the sense that they arise as infinite unfoldings of terms in λletrec, the λ-calculus with letrec. We provide two characterizations, using concepts we introduce for infinite λ-terms: regularity, strong regularity, ...
متن کاملExpressibility in the Lambda Calculus with
We address a problem connected to the unfolding semantics of functional programming languages: give a useful characterization of those infinite λ-terms that are λletrec-expressible in the sense that they arise as infinite unfoldings of terms in λletrec, the λ-calculus with letrec. We provide two characterizations, using concepts we introduce for infinite λ-terms: regularity, strong regularity, ...
متن کاملSymbolic Representation of Algorithmic Game Semantics
In this paper we revisit the regular-language representation of game semantics of second-order recursion free Idealized Algol with infinite data types. By using symbolic values instead of concrete ones we generalize the standard notion of regular-language and automata representations to that of corresponding symbolic representations. In this way terms with infinite data types, such as integers,...
متن کاملFinitary logics for coalgebras with branching
The purpose of this dissertation is to further previous work on coalgebras as infinite statebased transition systems and their logical characterisation with particular focus on infinite regular behaviour and branching. Finite trace semantics is well understood [DR95] for nondeterministic labelled transition systems, and has recently [Jac04, HJS06] been generalised to a coalgebraic level where m...
متن کاملProgram verification using symbolic game semantics
We introduce a new symbolic representation of algorithmic game semantics, and show how it can be applied for efficient verification of open (incomplete) programs. The focus is on an Algol-like programming language which contains the core ingredients of imperative and functional languages, especially on its second-order recursion-free fragment with infinite data types. We revisit the regular-lan...
متن کاملA Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to which state has an infinite run. Building the full type hierarchy upon this interpretation of the base type gives a finite semantics for simply-typed lambda-trees. A calculus based on this semantics is proven sound an...
متن کامل